An Iterative Process for Approximating Subactions

نویسندگان

چکیده

We describe a procedure based on the iteration of an initial function by appropriated operator, acting continuous functions, in order to get fixed point. This point will be calibrated subaction for doubling map circle and Lipschitz potential. study analytical generic properties this process we provide some computational evaluations subactions using discretization circle. The is unique if maximizing probability unique. proceed careful analysis dynamics operator close explain difficulty estimating its asymptotic behavior. show that convergence rate can moments like 1/2 sometimes arbitrarily 1.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New iteration process for approximating fixed points in Banach spaces

‎The object of this paper is to present a new iteration process‎. ‎We will show that our process is faster than the known recent iterative schemes‎. ‎We discuss stability results of our iteration and prove some results in the context of uniformly convex Banach space for Suzuki generalized nonexpansive mappings‎. ‎We also present a numerical example for proving the rate of convergence of our res...

متن کامل

An Iterative Tâtonnement Process

A discrete time tâtonnement process is presented for reaching an equilibrium of an exchange economy. The process is based on updating the prices in proportion to excess demands of the commodities such that the new prices are positive and their changes are bounded. Global convergence conditions for the process are given and convergence is shown when the excess demand function has the gross subst...

متن کامل

High order quadrature based iterative method for approximating the solution of nonlinear equations

In this paper, weight function and composition technique is utilized to speeds up the convergence order and increase the efficiency of an existing quadrature based iterative method. This results in the proposition of its improved form from a two-point quadrature based method of convergence order ρ = 3 with efficiency index EI = 1:3161 to a three-point method of convergence order ρ = 8 with EI =...

متن کامل

Planning as an Iterative Process

Activity planning for missions such as the Mars Exploration Rover mission presents many technical challenges, including oversubscription, consideration of time, concurrency, resources, preferences, and uncertainty. These challenges have all been addressed by the research community to varying degrees, but significant technical hurdles still remain. In addition, the integration of these capabilit...

متن کامل

An Iterative Algorithm on Approximating Fixed Points of Pseudocontractive Mappings

Let E be a real reflexive Banach space with a uniformly Gâteaux differentiable norm. Let K be a nonempty bounded closed convex subset of E, and every nonempty closed convex bounded subset of K has the fixed point property for non-expansive self-mappings. Let f : K → K a contractive mapping and T : K → K be a uniformly continuous pseudocontractive mapping with F T / ∅. Let {λn} ⊂ 0, 1/2 be a seq...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Springer proceedings in mathematics & statistics

سال: 2021

ISSN: ['2194-1009', '2194-1017']

DOI: https://doi.org/10.1007/978-3-030-78163-7_8